منابع مشابه
Jigsaw Percolation on Erdös-rényi Random Graphs
We extend the jigsaw percolation model to analyze graphs where both underlying people and puzzle graphs are Erdös-Rényi random graphs. Let pppl and ppuz denote the probability that an edge exists in the respective people and puzzle graphs and define peff = ppplppuz, the effective probability. We show for constants c1 > 1 and c2 > π /6 and c3 < e −5 if min(pppl, ppuz) > c1 logn/n the critical ef...
متن کاملThe Threshold for Jigsaw Percolation on Random Graphs
Jigsaw percolation is a model for the process of solving puzzles within a social network, which was recently proposed by Brummitt, Chatterjee, Dey and Sivakoff. In the model there are two graphs on a single vertex set (the ‘people’ graph and the ‘puzzle’ graph), and vertices merge to form components if they are joined by an edge of each graph. These components then merge to form larger componen...
متن کاملBootstrap percolation in random k-uniform hypergraphs
We investigate bootstrap percolation with infection threshold r > 1 on the binomial k-uniform random hypergraph Hk(n, p) in the regime n −1 nk−2p n−1/r, when the initial set of infected vertices is chosen uniformly at random from all sets of given size. We establish a threshold such that if there are less vertices in the initial set of infected vertices, then whp only a few additional vertices ...
متن کاملJ un 2 01 7 THE THRESHOLD FOR JIGSAW PERCOLATION ON RANDOM GRAPHS
Jigsaw percolation is a model for the process of solving puzzles within a social network, which was recently proposed by Brummitt, Chatterjee, Dey and Sivakoff. In the model there are two graphs on a single vertex set (the ‘people’ graph and the ‘puzzle’ graph), and vertices merge to form components if they are joined by an edge of each graph. These components then merge to form larger componen...
متن کاملPercolation on correlated random networks
We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model, and, by performing percolation processes, we get information about topology and resilience properties of the networks themselves. Given the weighted nature of the graphs, different kinds of bond percolation can be studied: stochastic (deleting links randomly) and deterministi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2017
ISSN: 0021-9002,1475-6072
DOI: 10.1017/jpr.2017.62